Korrupció: mérhetőség és modellezés = In the core of our study we focus on the connection of Foreign Direct Investment and corruption.

Tanulmányunk középpontjában a közvetlen külföldi befektetések és a korrupció kapcsolata áll. Feltételezésünk az, hogy a közvetlen külföldi befektetők a kevésbé korrupt országokat kedvelik, mivel a korrupció egy további kockázati tényezőt jelent a befektetők számára, amely növelheti a befektetések költségeit. Megítélésünk szerint ezt kvantitatív módszerekkel lehet a leginkább vizsgálni, így elemzésünk során 79 országot vizsgálunk meg 10 évre vonatkozó átlagokkal a GRETL program és az OLS becslőfüggvény segítségével. Több modell lefuttatása után azt az eredményt kaptuk, hogy a közvetlen külföldi befektetők döntéseiben a korrupció szignifikáns tényező, a két változó között negatív korrelációt figyelhetünk meg. ____ We assume that investors prefer countries where corruption level is lower, as corruption an additional risk factor that might increase the cost of investment. We believe that the best way to prove the previous statement if we use quantitative methods, so we set up a model where 79 countries are tested for 10 years averages, with the help of the GRETL and OLS estimator. After running several models our finding was that corruption is a significant factor in the decisions of foreign investors, and there is a negative correlation between corruption and FDI.

The kernel is in the least core for permutation games

Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter is a lower dimensional subset of the core. By means of a 5-player permutation game we demonstrate that, in sense of the lexicographic center procedure leading to the nucleolus, this inclusion result can not be strengthened. Our 5-player permutation game is also an example (of minimum size) for a game with a non-convex kernel.

Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.